Properties of Ascending Chains for Partial Difference Polynomial Systems
نویسندگان
چکیده
A characteristic set theory for partial difference polynomial systems is proposed. We introduce the concept of coherent and regular ascending chains and prove that a partial difference ascending chain is the characteristic set of its saturation ideal if and only if it is coherent and regular. This gives a method to decide whether a polynomial belongs to the saturation ideal of an ascending chain. We introduce the concept of strongly irreducible ascending chains and prove that a partial difference ascending chain is the characteristic set of a reflexive prime ideal if and only if it is strongly irreducible. This gives a simple and precise representation for reflexive prime ideals.
منابع مشابه
On Partial Difference Coherent and Regular Ascending Chains
In this paper, we propose a characteristic set theory for partial difference polynomial systems. First, we introduce the concept of coherent ascending chains and prove that the difference polynomials in the saturation ideal of a coherent ascending chain has a canonical representation. Second, we introduce the concept of regular chains and prove that a partial difference ascending chain is the c...
متن کاملA characteristic set method for ordinary difference polynomial systems
We prove several basic properties for difference ascending chains including a necessary and sufficient condition for an ascending chain to be the characteristic set of its saturation ideal and a necessary and sufficient condition for an ascending chain to be the characteristic set of a reflexive prime ideal. Based on these properties, we propose an algorithm to decompose the zero set of a finit...
متن کاملCharacteristic set method for differential-difference polynomial systems
In this paper, we present a characteristic set method for mixed differential and difference polynomial systems. We introduce the concepts of coherent, regular, proper irreducible, and strongly irreducible ascending chains and study their properties. We give an algorithm which can be used to decompose the zero set for a finitely generated differential and difference polynomial sets into the unio...
متن کاملA criterion for testing whether a difference ideal is prime
This paper presents a criterion for testing the irreducibility of a polynomial over an algebraic extension field. Using this criterion and the characteristic set method, the authors give a criterion for testing whether certain difference ascending chains are strong irreducible, and as a consequence, whether the saturation ideals of these ascending chains are prime ideals.
متن کاملOn the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کامل